Properties of Nucleon Resonances by means of a Genetic Algorithm

We present an optimization scheme that employs a Genetic Algorithm (GA) to determine the properties of low-lying nucleon excitations within a realistic photo-pion production model based upon an effective Lagrangian. We show that with this modern optimization technique it is possible to reliably assess the parameters of the resonances and the associated error bars as well as to identify weaknesses in the models. To illustrate the problems the optimization process may encounter, we provide results obtained for the nucleon resonances $\Delta$(1230) and $\Delta$(1700). The former can be easily isolated and thus has been studied in depth, while the latter is not as well known experimentally.Comment: 12 pages, 10 figures, 3 tables. Minor correction

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams

While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of {\em both} time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called {\em densest subgraph problem}. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge. In a graph $G = (V, E)$, the "density" of a subgraph induced by a subset of nodes $S \subseteq V$ is defined as $|E(S)|/|S|$, where $E(S)$ is the set of edges in $E$ with both endpoints in $S$. In the densest subgraph problem, the goal is to find a subset of nodes that maximizes the density of the corresponding induced subgraph. For any $\epsilon>0$, we present a dynamic algorithm that, with high probability, maintains a $(4+\epsilon)$-approximation to the densest subgraph problem under a sequence of edge insertions and deletions in a graph with $n$ nodes. It uses $\tilde O(n)$ space, and has an amortized update time of $\tilde O(1)$ and a query time of $\tilde O(1)$. Here, $\tilde O$ hides a O(\poly\log_{1+\epsilon} n) term. The approximation ratio can be improved to $(2+\epsilon)$ at the cost of increasing the query time to $\tilde O(n)$. It can be extended to a $(2+\epsilon)$-approximation sublinear-time algorithm and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm that can maintain the densest subgraph in {\em one pass}. The previously best algorithm in this setting required $O(\log n)$ passes [Bahmani, Kumar and Vassilvitskii, VLDB'12]. The space required by our algorithm is tight up to a polylogarithmic factor.Comment: A preliminary version of this paper appeared in STOC 201

Evidence of Skyrmion excitations about ν=1\nu =1 in n-Modulation Doped Single Quantum Wells by Inter-band Optical Transmission

We observe a dramatic reduction in the degree of spin-polarization of a two-dimensional electron gas in a magnetic field when the Fermi energy moves off the mid-point of the spin-gap of the lowest Landau level, $\nu=1$. This rapid decay of spin alignment to an unpolarized state occurs over small changes to both higher and lower magnetic field. The degree of electron spin polarization as a function of $\nu$ is measured through the magneto-absorption spectra which distinguish the occupancy of the two electron spin states. The data provide experimental evidence for the presence of Skyrmion excitations where exchange energy dominates Zeeman energy in the integer quantum Hall regime at $\nu=1$

Hall effect encoding of brushless dc motors

Encoding mechanism integral to the motor and using the permanent magnets embedded in the rotor eliminates the need for external devices to encode information relating the position and velocity of the rotating member

Sub-structural Niching in Estimation of Distribution Algorithms

We propose a sub-structural niching method that fully exploits the problem decomposition capability of linkage-learning methods such as the estimation of distribution algorithms and concentrate on maintaining diversity at the sub-structural level. The proposed method consists of three key components: (1) Problem decomposition and sub-structure identification, (2) sub-structure fitness estimation, and (3) sub-structural niche preservation. The sub-structural niching method is compared to restricted tournament selection (RTS)--a niching method used in hierarchical Bayesian optimization algorithm--with special emphasis on sustained preservation of multiple global solutions of a class of boundedly-difficult, additively-separable multimodal problems. The results show that sub-structural niching successfully maintains multiple global optima over large number of generations and does so with significantly less population than RTS. Additionally, the market share of each of the niche is much closer to the expected level in sub-structural niching when compared to RTS

Equation of state of two--dimensional 3^3He at zero temperature

We have performed a Quantum Monte Carlo study of a two-dimensional bulk sample of interacting 1/2-spin structureless fermions, a model of $^3$He adsorbed on a variety of preplated graphite substrates. We have computed the equation of state and the polarization energy using both the standard fixed-node approximate technique and a formally exact methodology, relying on bosonic imaginary-time correlation functions of operators suitably chosen in order to extract fermionic energies. As the density increases, the fixed-node approximation predicts a transition to an itinerant ferromagnetic fluid, whereas the unbiased methodology indicates that the paramagnetic fluid is the stable phase until crystallization takes place. We find that two-dimensional $^3$He at zero temperature crystallizes from the paramagnetic fluid at a density of 0.061 \AA$^{-2}$ with a narrow coexistence region of about 0.002 \AA$^{-2}$. Remarkably, the spin susceptibility turns out in very good agreement with experiments.Comment: 7 pages, 7 figure

Canonical General Relativity on a Null Surface with Coordinate and Gauge Fixing

We use the canonical formalism developed together with David Robinson to st= udy the Einstein equations on a null surface. Coordinate and gauge conditions = are introduced to fix the triad and the coordinates on the null surface. Toget= her with the previously found constraints, these form a sufficient number of second class constraints so that the phase space is reduced to one pair of canonically conjugate variables: \Ac_2\and\Sc^2. The formalism is related to both the Bondi-Sachs and the Newman-Penrose methods of studying the gravitational field at null infinity. Asymptotic solutions in the vicinity of null infinity which exclude logarithmic behavior require the connection to fall off like $1/r^3$ after the Minkowski limit. This, of course, gives the previous results of Bondi-Sachs and Newman-Penrose. Introducing terms which fall off more slowly leads to logarithmic behavior which leaves null infinity intact, allows for meaningful gravitational radiation, but the peeling theorem does not extend to $\Psi_1$ in the terminology of Newman-Penrose. The conclusions are in agreement with those of Chrusciel, MacCallum, and Singleton. This work was begun as a preliminary study of a reduced phase space for quantization of general relativity.Comment: magnification set; pagination improved; 20 pages, plain te